The Satisfactory Prostatectomy
نویسندگان
چکیده
منابع مشابه
What is the definition of a satisfactory erectile function after bilateral nerve sparing radical prostatectomy?
INTRODUCTION Different cut-offs of the erectile function (EF) domain of the International Index of Erectile Function (IIEF) have been used as definition of postoperative EF recovery. AIM To test the correlation between patient satisfaction and IIEF-EF domain score cut-offs. MAIN OUTCOME MEASURE The IIEF was used to evaluate EF and satisfaction before and after bilateral nerve sparing radica...
متن کاملThe satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [GK98, GK00] and further studied by other authors but its complexity remained open until now. We prove in this paper that Satisfac...
متن کاملCharacterization of the Satisfactory Decision Principle
This paper discusses essential significances of the satisfactory decision criterion in an axiomatical way. For decision problems under undertainty the traditional decision criteria, for instance, the max-min, the regret and the Laplace criterion are well known. The satisfactory decision criterion is another type of principle towards decision problems under uncertainty. The traditional decision ...
متن کاملComplexity of the satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [GK98, GK00] and further studied by other authors but its complexity remained open until now. We prove in this paper that Satisfac...
متن کاملApproximation of satisfactory bisection problems
The Satisfactory Bisection problem means to decide whether a given graph has a partition of its vertex set into two parts of the same cardinality such that each vertex has at least as many neighbors in its part as in the other part. A related variant of this problem, called Co-Satisfactory Bisection, requires that each vertex has at most as many neighbors in its part as in the other part. A ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Boston Medical and Surgical Journal
سال: 1905
ISSN: 0096-6762,1533-4406
DOI: 10.1056/nejm190505181522001